Probabilistic Dynamic Epistemic Logic

نویسنده

  • Barteld P. Kooi
چکیده

In this paper I combine the dynamic epistemic logic of Gerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1994). The result is a new probabilistic dynamic epistemic logic, a logic for reasoning about probability, information, and information change that takes higher order information into account. Probabilistic epistemic models are defined, and a way to build them for applications is given. Semantics and a proof system is presented and a number of examples are discussed, including the Monty Hall Dilemma.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending probabilistic dynamic epistemic logic

This paper aims to extend in two directions the probabilistic dynamic epistemic logic provided in Kooi’s paper [7] and to relate these extensions to ones made in [10]. Kooi’s probabilistic dynamic epistemic logic adds to probabilistic epistemic logic sentences that express consequences of public announcements. The paper [10] extends [7] to using action models, but in both papers, the probabilit...

متن کامل

Prolegomena to General-Imaging-Based Probabilistic Dynamic Epistemic Logic

In this paper, I propose a new version of probabilistic dynamic epistemic logic (GIPDEL) that is based on general imaging, and sketch the proof of soundness and completeness of this logic. The Monty Hall dilemma is a common topic in probabilistic dynamic epistemic logic. Using product-update-rule-based probabilistic dynamic epistemic logic (PUPDEL), Kooi ([7]) supported the answer that I should...

متن کامل

Dynamic Epistemic Logics

Dynamic epistemic logic, broadly conceived, is the study of rational social interaction in context, the study, that is, of how agents update their knowledge and change their beliefs on the basis of pieces of information they exchange in various ways. The information that gets exchanged can be about what is the case in the world, about what changes in the world, and about what agents know or bel...

متن کامل

Probabilistic Epistemic Updates on Algebras

Abstract. The present paper contributes to the development of the mathematical theory of epistemic updates using the tools of duality theory. Here we focus on Probabilistic Dynamic Epistemic Logic (PDEL). We dually characterize the product update construction of PDEL-models as a certain construction transforming the complex algebras associated with the given model into the complex algebra assoc...

متن کامل

Agreeing to disagree in probabilistic dynamic epistemic logic

Aumann’s agreeing to disagree theorem is a central theorem of game theory. This result says that if two agents have a common prior, then they cannot agree (have common knowledge of their posteriors) to disagree (while these posteriors are not identical). This thesis looks at the agreeing to disagree theorem from the perspective of probabilistic dynamic epistemic logic. The first goal of the the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Logic, Language and Information

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2003